Guaranteed stability with subspace methods
نویسندگان
چکیده
منابع مشابه
Guaranteed Stability with Subspace Methods
We show how stability of models can be guaranteed when using the class of identification algorithms which have become known as ‘subspace methods’. In many of these methods the ‘A’ matrix is obtained (or can be obtained) as the product of a shifted matrix with a pseudo-inverse. We show that whenever the shifted matrix is formed by introducing one block of zeros in the appropriate position, then ...
متن کاملSubspace identification with guaranteed stability using constrained optimization
In system identification, the true system is often known to be stable. However, due to finite sample constraints, modeling errors, plant disturbances and measurement noise, the identified model may be unstable. We present a constrained optimization method to ensure asymptotic stability of the identified model in the context of subspace identification methods. In subspace identification, we firs...
متن کاملStability of Krylov Subspace Spectral Methods
This talk summarizes recent analysis of an alternative approach to the solution of diffusion problems and wave propagation problems in the variable-coefficient case that leads to a new class of numerical methods, called Krylov subspace spectral methods [3]. The basic idea behind these methods, applied to a PDE of the form du/dt + L(x,D)u = 0, is to use Gaussian quadrature in the spectral domain...
متن کاملOn the Numerical Stability Analysis of Pipelined Krylov Subspace Methods
Algebraic solvers based on preconditioned Krylov subspace methods are among the most powerful tools for large scale numerical computations in applied mathematics, sciences, technology, as well as in emerging applications in social sciences. The study of mathematical properties of Krylov subspace methods, in both the cases of exact and inexact computations, is a very active area of research and ...
متن کاملSubspace Methods
Subspace analysis in computer vision is a generic name to describe a general framework for comparison and classification of subspaces. A typical approach in subspace analysis is the subspace method (SM) that classify an input pattern vector into several classes based on the minimum distance or angle between the input pattern vector and each class subspace, where a class subspace corresponds to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 1995
ISSN: 0167-6911
DOI: 10.1016/0167-6911(95)00010-7